multiple constraints造句
例句與造句
- Shadow extraction of building based on multiple constraints
多重約束下的建筑物陰影提取 - Multiple constraint based image feature points matching method
基于多約束的圖像特征點(diǎn)魯棒匹配方法 - If you have multiple constraints , enclose them in curly braces
如果擁有多個(gè)約束，請(qǐng)將它們置于大括號(hào)( - Example of multiple constraints
多個(gè)約束的示例 - A table can have multiple constraints , each of which is stored as a
一個(gè)表可以包含多個(gè)約束，其中每一個(gè)約束都存儲(chǔ)為表的 - It's difficult to find multiple constraints in a sentence. 用multiple constraints造句挺難的
- Multiple constraints can be applied to the same type parameter , and the constraints themselves can be generic types , as follows
可以對(duì)同一類(lèi)型參數(shù)應(yīng)用多個(gè)約束，并且約束自身可以是泛型類(lèi)型，如下所示： - Firstly , a nonlinear programming problem with multiple constraints can be converted into a programming problem with single constraint via maximum entropy function
先引入極大熵函數(shù)，將多個(gè)約束的非線(xiàn)性規(guī)劃問(wèn)題，轉(zhuǎn)化為只含一個(gè)約束的規(guī)劃問(wèn)題。 - The second one is to search approximative character points on fixed rigid body within design space , whose mathematic model is nonlinear and non - differential problem with multiple constraints
初始值問(wèn)題是長(zhǎng)期困擾機(jī)構(gòu)優(yōu)化綜合的一個(gè)難題，初始值的好壞決定著優(yōu)化過(guò)程的計(jì)算速度最優(yōu)值的好壞。 - In the paper , we focus on low power scheduling at the behavioral level , which partitions the behavior description into the time interval at multiple voltages and under multiple constraints
本文主要研究行為級(jí)的低功耗調(diào)度技術(shù)，是在多約束條件下，把工作在不同電壓下的操作分成具體的時(shí)間段進(jìn)行執(zhí)行的過(guò)程。 - In this thesis , firstly , the theory on multicast is introduced . secondly , a research is made on algorithm satisfying multiple constraints and an adaptive and reliable algorithm satisfying qos for multicast is proposed . it overcomes the shortcoming of the existent algorithms
本論文首先介紹了有關(guān)多播的相關(guān)知識(shí)；接著對(duì)有多個(gè)約束的多播路由問(wèn)題進(jìn)行了研究，并且給出了一種滿(mǎn)足qos約束可靠的適應(yīng)性多播路由算法。 - This main study of paper centralizes on following aspect : 1 . based on shortest path heuristic and greedy algorithms , using path similarity principle and genetic operations , provides a heuristic algorithms in finding multiple feasible paths for multiple constraints ( k - sph ) . 2
基于最短路徑( sph )和greedy算法，使用路徑相似性原：理和遺傳算法的變異操作，提出了尋找滿(mǎn)足1個(gè)或2個(gè)約束條件的多路徑啟發(fā)式算法(稱(chēng)為k - sph算法) 。 - Abstract firstly , convert a programming problem with multiple constraints into a programming problem with single constraint , secondly , several convexification and concavification transformations for the constrained problem with strictly monotone constraint functions are proposed according to the transformed problem with single constraint , then this constrained programming problem can be converted into a concave minimization or a reverse convex programming problem
摘要首先將一個(gè)具有多個(gè)約束的規(guī)劃問(wèn)題轉(zhuǎn)化為一個(gè)只有一個(gè)約束的規(guī)劃問(wèn)題，然后通過(guò)利用這個(gè)單約束的規(guī)劃問(wèn)題，對(duì)原來(lái)的多約束規(guī)劃問(wèn)題提出了一些凸化、凹化的方法，這樣這些多約束的規(guī)劃問(wèn)題可以被轉(zhuǎn)化為一些凹規(guī)劃、反凸規(guī)劃同題。 - Then , the mathematical models for workshop layout of general production line and automobile assembly - welding line are given , the topology model of multiple constraints expression and workshop layout is presented in depth , and then principles on position check and constraints check are also presented . a modified genetic algorithm is also proposed based on traditional generic algorithm
在此基礎(chǔ)上,以物流優(yōu)化和空間利用率最大化為目標(biāo),建立了車(chē)間設(shè)備布局的一般數(shù)學(xué)模型和汽車(chē)裝焊車(chē)間設(shè)備布局的數(shù)學(xué)模型;深入探討了多種約束表達(dá)和車(chē)間布局的拓?fù)淠Ｐ?提出了約束檢驗(yàn)的方法和位置判定的原則。